منابع مشابه
On the Erdos-Szekeres convex polygon problem
Let ES(n) be the smallest integer such that any set of ES(n) points in the plane in general position contains n points in convex position. In their seminal 1935 paper, Erdős and Szekeres showed that ES(n) ≤ ( 2n−4 n−2 ) + 1 = 4. In 1960, they showed that ES(n) ≥ 2 + 1 and conjectured this to be optimal. In this paper, we nearly settle the Erdős-Szekeres conjecture by showing that ES(n) = 2.
متن کاملThe Polygon Exploration Problem
We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed off-line. Our analysis is doubly founded on a novel geometric structure called the angle hull. Let D be a connected region inside a simple polygon, P . We define the angl...
متن کاملCluster connecting problem inside a polygon
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A logn-factor approximation algorithm is proposed.
متن کاملOn the Canonical k-vertex Polygon Spatial Retrieval Problem
The polygon retrieval problem on points is the problem of preprocessing a set of n points on the plane, so that given a polygon query, the subset of points lying inside it can be reported efficiently. It is of great interest in areas such as Computer Graphics, CAD applications, Spatial Databases and GIS developing tasks. In this paper we study the problem of canonical k-vertex polygon queries o...
متن کاملPolygon Morphing A Solution to the Vertex Correspondence Problem in 2D Polygon Morphing
This thesis deals with an approach, based on human perception to solve the vertex correspondence problem in two dimensional polygon morphing. Correspondences are established between points of high curvature and their local neighborhood in both source and target shape. To compare local neighborhoods, several criteria are introduced which compose a cost function, assigning costs depending on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1998
ISSN: 0022-247X
DOI: 10.1006/jmaa.1998.5955